|
| |
|
|
Client-server search engine for optimal public transport routes
Brát, Daniel ; Hošek, Jiří (referee) ; Myška, Vojtěch (advisor)
This bachelor thesis deals with the design and implementation of a client-server based program for finding the optimal path in public transport networks. Theoretical basics describe the Traveling salesman problem and mention some methods for finding its solution. This chapter is followed by a theoretical design of the application itself. Next chapter describes chosen technologies to be used. The last chapter describes the realization of the application itself. Reached goals are described in the conclusion.
|
|
| |
|
|
Ant colony
Hart, Pavel ; Hynčica, Ondřej (referee) ; Honzík, Petr (advisor)
First part of the thesis is about literature research of optimization algorithms. Three of the algorithms were implemented and tested, concretely the ant colony algorithm, tabu search and simulated annealing. All three algorithms were implemented to solve the traveling salesman problem. In second part of the thesis the algorithms were tested and compared. In last part the influence of the ant colony parameters was evaluated.
|
|
|
Traveling Salesman Problem
Šůstek, Martin ; Snášelová, Petra (referee) ; Zbořil, František (advisor)
This thesis is focused on modification of known principles ACO and GA to increase their performance. Thesis includes two new principles to solve TSP. One of them can be used as an initial population generator. The appendix contains the implementation of the application in Java. The description of this application is also part of the thesis. One part is devoted to optimization in order to make methods more efficient and produce shorter paths. In the end of the thesis are described experiments and their results with different number of places from 101 up to 3891.
|
|
|
Mathematical models for transportation problems
Votavová, Helena ; Novotný, Jan (referee) ; Popela, Pavel (advisor)
The thesis deals with modelling and solution techniques for the selected transportation problems. Firstly, historical remarks and application-related comments are introduced. Then the selected transportation problems are defined and mathematical programming and graph theory concepts are utilised to model them. The travelling salesman problem and suitable algorithms are under focus. The original implementation in GAMS and Python is discussed. Algorithms have been tested for the instance based on the set of 73 towns in the Czech Republic. Finally, the test results are evaluated and compared.
|
|
|
Traveling Salesman Problem: Parallel Methods Using SMP (Threads)
Weigner, Martin ; Jaroš, Jiří (referee) ; Kašpárek, Tomáš (advisor)
This thesis is focused on solving the problem of traveling salesman. At first, the problem is solved by serial access at four algorithms. There are two of them chosen and transferred to parallel access. In the end there are summarized observations about different parameters of both access. This thesis also introduces questions of programming parallel applications with threads to the reader.
|
|
|
Evolutionary algorithms
Haupt, Daniel ; Polách, Petr (referee) ; Honzík, Petr (advisor)
The first part of this work deals with the optimization and evolutionary algorithms which are used as a tool to solve complex optimization problems. The discussed algorithms are Differential Evolution, Genetic Algorithm, Simulated Annealing and deterministic non-evolutionary algorithm Taboo Search.. Consequently the discussion is held on the issue of testing the optimization algorithms through the use of the test function gallery and comparison solution all algorithms on Travelling salesman problem. In the second part of this work all above mentioned optimization algorithms are tested on 11 test functions and on three models of placement cities in Travelling salesman problem. Firstly, the experiments are carried out with unlimited number of accesses to the fitness function and secondly with limited number of accesses to the fitness function. All the data are processed statistically and graphically.
|
|
|
Evolutionary computing
Popelka, Jan ; Smékal, Zdeněk (referee) ; Karásek, Jan (advisor)
The aim of this Bachelor's Thesis was to get acquainted with the Evolutionary Optimization Techniques, mainly with the Genetic Algorithm and Genetic Programming. It was subsequently described the role of optimization problem TSP solved using Genetic Algorithms and other Chapter solving Symbolic Regression using Genetic Programming. This optimalization problems were created in the programming JAVA and there are solved practical part of the thesis.
|
|
|
Solving Optimization Tasks by ACO Algorithms
Habrnál, Matěj ; Samek, Jan (referee) ; Zbořil, František (advisor)
The presented thesis puts its main focus on the basic optimization algorithms ACO (Ant Colony Optimization) and their development and seeks the inspiration in the ants live. The aim is to demonstrate the activity of these algorithms on optimization problems - the traveling salesman problem and the finding food sources problem and optimal routes between an anthill and food. The thesis also describes experiments that try to determine the influence of adjustable parameters of ant algorithms. First, ACO algorithms theory is described followed then by the application of these algorithms on both selected optimization problems. The conclusion sums up experiments analysis with established applications and evaluating prospective results.
|
guest ::
